Automated Sized-Type Inference and Complexity Analysis

Automated Sized-Type Inference and Complexity Analysis

Index Language. Unlike in [8], where indices are formed over naturals and addition, we keep the index language abstract. This allows for more flexibility, and ultimately for a better intensionality. Indeed, having the freedom of not adopting a fixed index language is known to lead towards completeness [5]. Polymorphic Recursion over Sizes. Type inference in functional programming languages, suc...

Automating Sized Type Inference for Complexity Analysis (Technical Report)

This paper introduces a new methodology for the complexity analysis of higher-order functional programs, which is based on three ingredients: a powerful type system for size analysis and a sound type inference procedure for it, a ticking monadic transformation, and constraint solving. Noticeably, the presented methodology can be fully automated, and is able to analyse a series of examples which...

Sized Type Analysis for Logic Programs

We present a novel analysis for relating the sizes of terms and subterms occurring at different argument positions in logic predicates. We extend and enrich the concept of sized type as a representation that incorporates structural (shape) information and allows expressing both lower and upper bounds on the size of a set of terms and their subterms at any position and depth. For example, expres...

Factoring and Automated Inference

We extend SQL’s grant/revoke model to handle all administration of permissions in a distributed database. The key idea is to “factor” permissions into simpler decisions that can be administered separately, and for which we can devise sound inference rules. The model enables us to simplify administration via separation of concerns (between technical DBAs and domain experts), and to justify fully...

Automated Complexity Analysis of Term Rewrite Systems